Non-Zero Sum Games for Reactive Synthesis
نویسندگان
چکیده
In this invited contribution [7], we summarize new solution concepts useful for the synthesis of reactive systems that we have introduced in several recent publications. These solution concepts are developed in the context of non-zero sum games played on graphs. They are part of the contributions obtained in the inVEST project funded by the European Research Council.
منابع مشابه
A TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS
In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...
متن کاملSynthesis of Strategies for Non-Zero-Sum Repeated Games
Title of dissertation: SYNTHESIS OF STRATEGIES FOR NON-ZERO-SUM REPEATED GAMES Tsz-Chiu Au, Doctor of Philosophy, 2008 Dissertation directed by: Professor Dana Nau Department of Computer Science There are numerous applications that involve two or more self-interested autonomous agents that repeatedly interact with each other in order to achieve a goal or maximize their utilities. This dissertat...
متن کاملA survey of stochastic ω-regular games
We summarize classical and recent results about two-player games played on graphs with ωregular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-based or concurrent; deterministic or stochastic; zero-sum or not. We cluster known results and open problems according to these classifications.
متن کاملComputer Aided Synthesis: A Game-Theoretic Approach
In this invited contribution, we propose a comprehensive introduction to game theory applied in computer aided synthesis. In this context, we give some classical results on two-player zero-sum games and then on multi-player non zero-sum games. The simple case of one-player games is strongly related to automata theory on infinite words. All along the article, we focus on general approaches to so...
متن کاملBimatrix Games
These are two person non-zero(constant)-sum games in which each player has finitely many pure strategies. We call these non-zero(constant)sum games because the interests of the players is not required to be exactly opposed to each other. Of course, these include zero(constant)-sum games and are a true generalization of zero(constant)-sum games. But the methods used to analyze them are different...
متن کامل